Efficient algorithms for decoding Reed-Solomon codes with erasures
نویسنده
چکیده
In this paper, we present a new algorithm for decoding Reed-Solomon codes with both errors and erasures. The algorithm combines an efficient method for solving the Key Equation and a technique which separates the error locator polynomial from the erasure locator polynomial. The new algorithm is compared to two other efficient Reed-Solomon decoding algorithms and shown to be significantly faster for errors and erasures decoding. Applications to BCH decoding are also provided.
منابع مشابه
Efficient Erasure Decoding for Generalized Reed Solomon Codes
We present an efficient erasure decoding algorithm for generalized Reed Solomon codes constructed by utilizing the structure of the inverse of the VanderMonde matrices. Given an [n, k] generalized Reed Solomon code, decoding for r erasures, where r = n − k, requires rk + n Galois field multiplications and r(k − 1) Galois field additions after setting up the decoding structures for an erasure pa...
متن کاملEfficient erasure decoding of Reed-Solomon codes
We present a practical algorithm to decode erasures of Reed-Solomon codes over the q elements binary field in O(q log 2 q) time where the constant implied by the O-notation is very small. Asymptotically fast algorithms based on fast polynomial arithmetic were already known, but even if their complexity is similar, they are mostly impractical. By comparison our algorithm uses only a few Walsh tr...
متن کاملA simple algorithm for decoding both errors and erasures of Reed-Solomon codes
A simple algorithm for decoding both errors and erasures of ReedSolomon codes is described.
متن کاملNew array codes for multiple phased burst correction
Abstmct-A new optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is presented. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts...
متن کاملA Class Of Array Codes Correcting Multiple Column Erasures - Information Theory, IEEE Transactions on
A family of binary array codes of size (p 1) n, p a prime, correcting multiple column erasures is proposed. The codes coincide with a subclass of shortened Reed–Solomon codes and achieve the maximum possible correcting capability. Complexity of encoding and decoding is proportional to rnp, where r is the number of correctable erasures, i.e., is simpler than the Forney decoding algorithm. The le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014